Computing Polycyclic Quotients of Finitely (L-)Presented Groups via Groebner Bases
نویسندگان
چکیده
We announce the development and implementation of a new GAP package PCQL. This facilitates the computation of consistent polycyclic presentations for polycyclic quotients of groups defined by a so-called finite L-presentation. This type of presentation incorporates all finite presentations as well as certain infinite presentations. The algorithm allows a variety of polycyclic quotients ranging from maximal nilpotent quotients of a given class to the maximal solvable quotients of a given derived length. The algorithm uses Groebner bases over integral group rings of polycyclic groups as main means of its computation.
منابع مشابه
Representing Subgroups of Finitely Presented Groups by Quotient Subgroups
CONTENTS This article proposes to represent subgroups of finitely presented 1 . Creation of Quotient Representations and Easy Calculations g r o u p s b y t h e i r i m a g e i n a quo t ient. It gives algorithms for basic 2. Subdirect Products operations in this representation and investigates how iteration 3. Iterated Quotient Representations of this approach can be used to extend known quoti...
متن کاملGroebner Bases in Non-Commutative Algebras
INTRODUCTION Recently, the use of Groebner bases and Buchberger algorithm [BUC1,2,4] has been generalised from the case of commutative polynomials to finitely generated algebras R over a field k, R = k, s.t. for each i < j, for some cij ∈ k, for some commutative polynomial pij ∈ k[X1,...,Xn], one has xj xi cij xi xj = pij(x1,...,xn). The first results in this direction were due to Ga...
متن کاملFitting quotients of finitely presented abelian-by-nilpotent groups
We show that every finitely generated nilpotent group of class 2 occurs as the quotient of a finitely presented abelian-by-nilpotent group by its largest nilpotent normal subgroup.
متن کاملComputing nilpotent quotients in finitely presented Lie rings
A nilpotent quotient algorithm for finitely presented Lie rings over Z (LIENQ) is described. The paper studies the graded and non-graded cases separately. The algorithm computes the so-called nilpotent presentation for a finitely presented, nilpotent Lie ring. A nilpotent presentation consists of generators for the abelian group and the products expressed as linear combinations for pairs formed...
متن کاملDecidable Properties of Polycyclic Groups
The classical decision problems of group theory were formulated with finitely presented groups in mind. In this generality they are all known to be algorithmically insoluble (Novikov, Boone, Adian and Rabin). The recent work of Kharlampovich and Baumslag, Gildenhuys and Strebel [9,2] has established similar negative results within the category of finitely presented soluble groups. The picture i...
متن کامل